Depth/Breadth first search with applications
نویسنده
چکیده
Given a graph G = (V,E) and a vertex u ∈ V , we would like to explore every vertex (and every edge) reachable from u. Let n = |V | and m = |E|. The graph may be directed or undirected. We will assume that the graph is given in its adjacency list representation (rather than adjacency matrix), i.e. for each vertex u, we have a linked list adj[u] of the neighbors of u (all vertices v such that (u, v) ∈ E. The advantages of such representation are:
منابع مشابه
Breadth-Depth Search is P-Complete
The parallel complexity of a search strategy that combines attributes of both breadth-rst search and depth-rst search is studied. The search called breadth-depth search was deened by Horowitz and Sahni. The search technique has applications in branch-and-bound strategies. Kindervater and Lenstra posed the complexity of this type of search strategy as an open problem. We resolve their question b...
متن کاملAn Analysis of Consecutively Bounded Depth-First Search with Applications in Automated Deduction
Consecutively bounded depth-first search involves repeatedly performing exhaustive depth-first search with increasing depth bounds of 1, 2, 3, and so on. The effect is similar to that of breadth-first search, but, instead of retaining the results at level n 1 for use in computing level n, earlier results are recomputed. Consecutively bounded depth-first search is useful whenever a complete sear...
متن کاملCombining Breadth-First and Depth-First Strategies in Searching for Treewidth
Breadth-first and depth-first search are basic search strategies upon which many other search algorithms are built. In this paper, we describe an approach to integrating these two strategies in a single algorithm that combines the complementary strengths of both. We show the benefits of this approach using the treewidth problem as an example.
متن کاملStaggered Sphere Decoding for MIMO detection
MIMO system is a key technology for future high speed wireless communication applications. At present MIMO systems are constrained by efficient detection algorithms/hardware architectures. In past much attention has been paid to either Sphere Decoder (Depth First Search), or K-best algorithm (breadth first search. Very little attention has been paid to architectures that combine these two appro...
متن کاملSearch strategies for functional logic programming
In this paper we discuss our practical experiences with the use of different search strategies in functional logic programs. In particular, we show that complete strategies, like breadth-first search or iterative deepening search, are a viable alternative to incomplete strategies, like depth-first search, that have been favored in the past for logic programming languages.
متن کاملA appraisal paper on Breadth-first search, Depth-first search and Red black tree
Breadth-first and depth-first search are indispensable adventure strategies leading which many other rummage around algorithms are built. In this dissertation, we projected an loomed of integrating these two strategies in a solitary algorithm that combines the corresponding strengths of mutual. We account preliminary computational outcome using the tree width predicament as an example. This dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014